| Lawrence Paulson | |
|---|---|
| Born | 1955 |
| Institutions | University of Cambridge |
| Alma mater | California Institute of Technology Stanford University |
| Known for | ML |
Lawrence Charles Paulson (born 1955) is a professor at the University of Cambridge Computer Laboratory and a fellow of Clare College. He lectures courses on the foundations of computer science, logic and proof among others. He is best known for the cornerstone text on the programming language ML, ML for the Working Programmer [1]. His research is based around the interactive theorem prover Isabelle. He has worked on the verification of cryptographic protocols using inductive definitions, and he has also formalized the constructible universe of Kurt Gödel. Current research projects are described on his web page.
Paulson graduated from the California Institute of Technology in 1977, and obtained his PhD in Computer Science from Stanford University. He came to the University of Cambridge in 1983 and became a fellow in 1987. He is widowed, with two children. He is a Fellow of the Association for Computing Machinery (2008).